Some Measures of Agreement Between Close Partitions
نویسندگان
چکیده
In order to measure the similarity between two partitions coming from the same data set, we study extensions of the RV-coefficient, the kappa coefficient proposed by Cohen (in case of partitions with same number of classes), and the D2 coefficient proposed by Popping. We find that the RV coefficient is identical to the Janson and Vegelius index. We compare the result coming from kappa’s coefficient to the ordination given by correspondence analysis. We study the empirical distribution of these indices under the hypotheses of a common partition. For this purpose, we use data coming from a latent profile model to formulate the null hypothesis.
منابع مشابه
Tsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions
The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...
متن کاملEvaluation of Jackknife and Bootstrap for Defining Confidence Intervals for Pairwise Agreement Measures
Several research fields frequently deal with the analysis of diverse classification results of the same entities. This should imply an objective detection of overlaps and divergences between the formed clusters. The congruence between classifications can be quantified by clustering agreement measures, including pairwise agreement measures. Several measures have been proposed and the importance ...
متن کاملTools to study trends in community structure: application to fish and livestock trading networks.
Partitioning of contact networks into communities allows groupings of epidemiologically related nodes to be derived, that could inform the design of disease surveillance and control strategies, e.g. contact tracing or design of 'firebreaks' for disease spread. However, these are only of merit if they persist longer than the timescale of interventions. Here, we apply different methods to identif...
متن کاملCentrality and Distribution of Partitions according to the Transfer Distance
The comparison of partitions is a central topic in clustering, as well for comparing partitioning algorithms as for classifying nominal variables. In this paper, we deal with the transfer distance between partitions, defined as the minimum number of transfers of one element from its class to another (eventually empty) necessary to turn one partition into the other one. We study the distribution...
متن کاملFrom Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, which are originally used to compare two clusterings (the obtained clustering vs. a ground truth clustering) for the evaluation of a clustering algorithm. Though we can follow a greedy strategy to optimize these measures a...
متن کامل